Without Expert Fuzzy based Data Mining based on Fuzzy Similarity to Mine New Association Rules

نویسندگان

  • Gagan Dhawan
  • Aakanksha Mahajan
چکیده

The problem of mining association rules in a database are introduced. Most of association rule mining approaches aim to mine association rules considering exact matches between items in transactions. A new algorithm called ―Without expert fuzzy based data mining Based on Fuzzy Similarity to mine new Association Rules ‖ which considers not only exact matches between items, but also the fuzzy similarity between them. In this paper their should not be a requirement to have an expert for finding similarity between items. Without expert fuzzy based(WEFB) Data Mining Based on fuzzy Similarity to mine new Association Rules uses the concepts of without expert to represent the similarity degree between items, and proposes a new way of obtaining support and confidence for the association rules containing these items. The problem is to find all association rules that satisfy userspecified minimum support and minimum confidence constraints. This paper then results that new rules bring more information about the database.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

SSDM: A Semantically Similar Data Mining Algorithm

Most of association rule mining approaches aim to mine association rules considering exact matches between items in transactions. In this paper we present a new algorithm called SSDM (Semantically Similar Data Miner), which considers not only exact matches between items, but also the semantic similarity between them. SSDM uses fuzzy logic concepts to represent the similarity degree between item...

متن کامل

Genetic learning of the membership functions for mining fuzzy association rules from low quality data

Many methods have been proposed to mine fuzzy association rules from databases with crisp values in order to help decision-makers make good decisions and tackle new types of problems. However, most real-world problems present a certain degree of imprecision. Various studies have been proposed to mine fuzzy association rules from imprecise data but they assume that the membership functions are k...

متن کامل

Design and Implementation of WSRF-Compliant Grid Services for Mining Fuzzy Association Rules

Data mining is a widely used approach for the transformation of large amounts of data to useful patterns and knowledge. Fuzzy association rules mining is a data mining technique which tries to nd association rules without the e ect of sharp boundary problems when data contains continuous and categorical attributes. Grid data mining is a new concept, which allows the data mining process to be de...

متن کامل

Algorithm of the Inverse Confidence of Data Mining Based on the Techniques of Association Rules and Fuzzy Logic

This article proposes an algorithm for data mining that presents a new measure for assistance in the extraction of knowledge. The algorithm uses association rules to extract rules from the databases and fuzzy logic for the classification and comparison of the collected rules. Key-words: data mining, association rules, fuzzy logic, similarity and algorithm of the inverse confidence.

متن کامل

Optimizing Membership Functions using Learning Automata for Fuzzy Association Rule Mining

The Transactions in web data often consist of quantitative data, suggesting that fuzzy set theory can be used to represent such data. The time spent by users on each web page is one type of web data, was regarded as a trapezoidal membership function (TMF) and can be used to evaluate user browsing behavior. The quality of mining fuzzy association rules depends on membership functions and since t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011